-
1 простая цепь
1) Engineering: single-stranded chain (молекулы)2) Mathematics: catenary graph, elementary chain, simple chain, simple path, simple path (graph theory)3) Graph theory: circuit -
2 цепь
f. chain, circuit; цепь Маркова, Markov chain; условие обрыва цепей, chain condition; -цепь, cochain; цепь сизигий, chain syzygies; цепь рёбер, path (graph theory); простая цепь, simple path; секущая цепь, cross-path (graph theory) -
3 цепь
f. chain, circuit;
цепь Маркова - Markov chain;
условие обрыва цепей - chain condition;
∇-цепь - cochain;
цепь сизигий - chain syzygies;
цепь рёбер - path ( graph theory)
простая цепь - simple path;
секущая цепь - cross-path ( graph theory) -
4 цепь
f.chain, circuit -
5 орцепь
-
6 орцепь
abbrev (ориентированная цепь), oriented path (graph theory) -
7 секущий
adj. intersecting, cutting; секущая линия, f., secant; секущая поверхность, f., cross-section, intersecting surface; секущая цепь, cross-path ( graph theory) -
8 секущая цепь
Mathematics: cross-path (graph theory) -
9 цепь рёбер
Mathematics: path (graph theory) -
10 секущий
* * *adj. intersecting, cutting;
секущая линия - f. secant;
секущая поверхность - f. cross-section, intersecting surface;
секущая цепь - cross-path ( graph theory) -
11 ориентированная цепь
abbrev. орцепьРусско-английский словарь по математике > ориентированная цепь
-
12 орцепь
abbrev. for ориентированная цепь -
13 секущий
adj.intersecting, cuttingсекущая линия — f. secant
секущая поверхность — f. cross-section, intersecting surface
-
14 теория графов
Русско-английский словарь по информационным технологиям > теория графов
-
15 теория графов
Бизнес, юриспруденция. Русско-английский словарь > теория графов
См. также в других словарях:
Path (graph theory) — In graph theory, a path in a graph is a sequence of vertices such that from each of its vertices there is an edge to the next vertex in the sequence. The first vertex is called the start vertex and the last vertex is called the end vertex . Both… … Wikipedia
Path graph — infobox graph name = Path graph image caption = A path graph vertices = n edges = n 1 automorphisms = 2 diameter = n 1 radius = ⌊n/2⌋ chromatic number = 2 chromatic index = 2 properties = Unit distance Bipartite graphIn the mathematical field of… … Wikipedia
graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… … Universalium
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
graph theory — A branch of mathematics used to represent relations and networks. A graph consists of a set of points (nodes or vertices) and the pairwise links between them (arcs or lines). In sociological applications, the nodes are typically individuals,… … Dictionary of sociology
List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 … Wikipedia
Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number … Wikipedia
Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… … Wikipedia
Connectivity (graph theory) — In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) which need to be removed to disconnect the remaining nodes from each other[1]. It is… … Wikipedia
Tournament (graph theory) — Tournament A tournament on 4 vertices Vertices n Edges … Wikipedia
Degree (graph theory) — A graph with vertices labeled by degree In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice.[1] The degree of a vertex … Wikipedia
